Planar Depth and Planar Subalgebras
نویسندگان
چکیده
منابع مشابه
Fast planar segmentation of depth images
One of the major challenges for applications dealing with the 3D concept is the real-time execution of the algorithms. Besides this, for the indoor environments, perceiving the geometry of surrounding structures plays a prominent role in terms of application performance. Since indoor structures mainly consist of planar surfaces, fast and accurate detection of such features has a crucial impact ...
متن کاملOn External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no spaceand I/O-efficient algorithms are known for depth-first search or breath-first search in sparse graphs. In this paper, we present two new results on I/O-efficient depth-first search in an important class of sparse graphs, namely undirected emb...
متن کاملComputing the Planar $\beta$-skeleton Depth
For β ≥ 1, the β-skeleton depth (SkDβ) of a query point q ∈ Rd with respect to a distribution function F on Rd is defined as the probability that q is contained within the β-skeleton influence region of a random pair of points from F . The β-skeleton depth of q ∈ Rd can also be defined with respect to a given data set S ⊆ Rd. In this case, computing the β-skeleton depth is based on counting all...
متن کاملReal-time Planar Segmentation of Depth Images
Handling depth images as a point cloud in a 3D data framework and performing planar segmentation in real-time requires heavy computation and it is a major challenge. Available planar-segmentation algorithms are mostly based on surface normals and/or curvatures, and consequently, do not provide real-time performance. In this abstract paper, we introduce a real-time planar-segmentation method for...
متن کاملPlanar Patch Extraction with Noisy Depth Data
This paper presents an algorithm for extracting planar patches by integrating both intensity and range data provided by a stereo system. For dealing with noisy and sparse range data, the initial segmentation is based on intensity information, and then the resulted regions are thresholded using depth data. This new algorithm, different from the existing ones that use only range data in the segme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2002
ISSN: 0022-1236
DOI: 10.1006/jfan.2002.3937